منابع مشابه
A model-theoretic reconstruction of Frege's permutation argument
In what follows this assertion will be called the identifiability thesis since it states that two arbitrary but different courses-of-values can be identified with the truthvalues. Frege considers the identifiability thesis a consequence of his previous argumentation ([3], p. 17, lines 23-36) which, following Dummett ([1], p. 408), will be called the permutation argument, because the concept of ...
متن کاملArgument or no argument ?
We will call such adjuncts instances of the X or no X construction It was suggested in the middle 1980s by Alexis Manaster-Ramer that well-formed instances of X or no X involve a string X of unbounded length preceding or no, with an exact copy following (for a brief allusion to it in print, see Manaster-Ramer 1986). This claim has received hardly any discussion at all in the subsequent literatu...
متن کاملPermutation tableaux and permutation patterns
Lauren Williams (joint work with Einar Steingrímsson) We introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the " Le-diagrams " of Alex Postnikov. The structure of these tableaux is in some ways more transparent than the structure of permutations; therefore we believe tha...
متن کاملThe Doomsday Argument and the Simulation Argument
The Doomsday Argument and the Simulation Argument share certain structural features, and hence are often discussed together (Bostrom 2003, Are you living in a computer simulation, Philosophical Quarterly, 53:243–255; Aranyosi 2004, The Doomsday Simulation Argument. Or why isn’t the end nigh, and you’re not living in a simulation, http://philsci-archive.pitt.edu/190/; Richmond 2008, Doomsday, Bi...
متن کاملPermutation Bigraphs: An Analogue of Permutation Graphs
We introduce the class of permutation bigraphs as an analogue of permutation graphs. We show that this is precisely the class of bigraphs having Ferrers dimension at most 2. We also characterize the subclasses of interval bigraphs and indifference bigraphs in terms of their permutation labelings, and we relate permutation bigraphs to posets of dimension 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1987
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093636845